Symbolic derivation of Runge–Kutta order conditions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Symbolic derivation of Runge-Kutta order conditions

Tree theory, partitions of integer numbers, combinatorial mathematics and computer algebra are the basis for the construction of a powerful and efficient symbolic package for the derivation of Runge Kutta order conditions and principal truncation error terms.

متن کامل

Symbolic Derivation of Order Conditions for Hybrid Numerov-type methods solving

Numerov-type ODE Solvers are widely used for the numerical treatment of second order initial value problems. In this work we present a powerful and efficient symbolic code in Mathematica for the derivation of their order conditions and principal truncation error terms. The relative tree theory for such order conditions is presented along with the elements of combinatorial mathematics, partition...

متن کامل

A Symbolic Derivation of Beta-splines of Arbitrary Order

Beta-splines are a class of splines with applications in the construction of curves and surfaces for computer-aided geometric design. One of the salient features of the Beta-spline is that the curves and surfaces thus constructed are geometrically continuous, a more general notion of continuity than the one used in ordinary B-splines. The basic building block for Beta-splines of order k is a se...

متن کامل

Effective order strong stability preserving RungeKutta methods

We apply the concept of effective order to strong stability preserving (SSP) explicit Runge–Kutta methods. Relative to classical Runge–Kutta methods, effective order methods are designed to satisfy a relaxed set of order conditions, but yield higher order accuracy when composed with special starting and stopping methods. The relaxed order conditions allow for greater freedom in the design of ef...

متن کامل

Derivation of Don't care Conditions

In this paper we present a framework for the derivation of don', care conditions by permrbaIion analysis of combinational multiple-level digital cUcuilS. The contribution of the paper is two-fold. First. different approximations of observability don', care selS are compared quantitatively. S~d. the perturbation analysis is used to derive new compatible obsa'Vabilily don', care sets. that are la...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Symbolic Computation

سال: 2004

ISSN: 0747-7171

DOI: 10.1016/j.jsc.2003.07.001